Kinetic Theory of Random Graphs
نویسندگان
چکیده
Statistical properties of evolving random graphs are analyzed using kinetic theory. Treating the linking process dynamically, structural characteristics of links, paths, cycles, and components are obtained analytically using the rate equation approach. Scaling laws for finite systems are derived using extreme statistics and scaling arguments.
منابع مشابه
Unicyclic Components in Random Graphs
Random graphs underly processes such as polymerization [1], percolation [2], and the formation of social networks [3, 4]. Random graphs have been extensively studied, especially in theoretical computer science [5, 6]. Special families of random graphs have been also examined, e.g., planar random graphs appear in combinatorics [7, 8] and in physics [9]. The basic framework for generic random gra...
متن کاملKinetic theory of random graphs: from paths to cycles.
The structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically. At the gelation point, the typical length of paths and cycles, l , scales with the component size k as l approximately k(1/2) . Dynamic and finite-size ...
متن کاملEffects of coupling on turbulent gas-particle boundary layer flows at borderline volume fractions using kinetic theory
This study is concerned with the prediction of particles’ velocity in a dilute turbulent gas-solidboundary layer flow using a fully Eulerian two-fluid model. The closures required for equationsdescribing the particulate phase are derived from the kinetic theory of granular flows. Gas phaseturbulence is modeled by one-equation model and solid phase turbulence by MLH theory. Resultsof one-way and...
متن کاملMatchings in Random Biregular Bipartite Graphs
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdős and Rényi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.
متن کاملRandom Graphs: Theory and Applications from Nature to Society to the Brain
The theory of random graphs deals with asymptotic properties of graphs equipped with a certain probability distribution; for example, it studies how the component structure of a uniform random graph evolves as the number of edges increases. Since the foundation of the theory of random graphs by Erdős and Rényi five decades ago, various random graph models have been introduced and studied. Graph...
متن کامل